Cops and Robber Game Without Recharging
نویسندگان
چکیده
منابع مشابه
Cops and Robber Game in Multidimensional Grids
We theoretically analyze the Cops and Robber Game for the first time in a multidimensional grid. It is shown that in an n-dimensional grid, at least n cops are necessary if one wants to catch the robber under all possible initial configurations. We also present a set of cop strategies for which n cops are provably sufficient to catch the robber.
متن کاملCops, Robber, and Alarms
The two games considered are mixtures of Searching and Cops and Robber. The cops have partial information, provided first via selected vertices of a graph, and then via selected edges. This partial information includes the robber's position, but not the direction in which he is moving. The robber has perfect information. In both cases, we give bounds on the amount of such information required b...
متن کاملA witness version of the Cops and Robber game
The games considered aremixtures of Searching andCops andRobber. The cops havepartial information provided viawitnesseswho report ‘‘sightings’’ of the robber. Thewitnesses are able to provide information about the robber’s position but not the direction in which he is moving. The robber has perfect information. In the case when sightings occur at regular intervals, we present a recognition theo...
متن کاملA cops and robber game in multidimensional grids
We theoretically analyze the Cops and Robber Game for the first time in a multidimensional grid. It is shown that for an ndimensional grid, at least n cops are necessary to ensure capture of the robber. We also present a set of cop strategies for which n cops are provably sufficient to catch the robber. Further, for two-dimensional grid, we provide an efficient cop strategy for which the robber...
متن کاملCops and Robber Game with a Fast Robber on Interval, Chordal, and Planar Graphs
We consider a variant of the Cops and Robber game, introduced by Fomin, Golovach, Kratochv́ıl, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. We study this game on interval graphs, chordal graphs, planar graphs, and hypercube graphs. Let c∞(G) denote the number of cops needed to captu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2011
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-011-9360-5